Cosmological analysis of reconstructed $${\mathcal {F}}(T,T_{\mathcal {G}})$$ F ( T , T G ) models

T F S C M T  G T  F

In this paper, we extend our ideas on model transformations as functors discussed in the previous issue and embed this concept into the framework of graph transformation systems. We show that under certain restrictions of the rules model transformations by graph transformation are functors.

OSCILLATORY AND ASYMPTOTIC BEHAVIOR OF dx dt + Q ( t ) G ( x ( t − σ ( t ) ) ) = f ( t )

Consider the equation dx dt +Q(t)G(x(t− σ(t))) = f(t) (∗) where f, σ,Q ∈ C([0,∞), [0,∞)), G ∈ C(R,R),G(−x) = −G(x), xG(x) > o for x 6= 0, G is non-decreasing, t > σ(t), σ(t) is decreasing and t − σ(t) → ∞ as t → ∞. Whenf(t) ≡ 0, a sufficient condition in terms of the constants k = lim inf t→∞ Z

A Markov model for measuring service levels in nonstationary G(t)/G(t)/s(t) +G(t) queues

We present a Markov model to approximate the queueing behavior at the G(t)/G(t)/s(t) + G(t) queue with exhaustive discipline and abandonments. The performance measures of interest are: (1) the average number of customers in queue, (2) the variance of the number of customers in queue, (3) the average number of abandonments and (4) the virtual waiting time distribution of a customer when arriving...

G T R

We study the notion of a stub equality for a congruence generated by a ground term rewrite system (GTRS). We study the congruence generated by the union of GTRSs R and S , where the congruences generated by R and S intersect with respect to their stubs. We show that for any equivalent reduced GTRSs R and S , the same number of terms appear as subterms in R as in S . We give an upper bound on th...

G E H T